Constructing Identity-based Cryptographic Scheme for Qer Cryptosystem
نویسندگان
چکیده
Abstract: In 1984, Shamir proposed the concept of the identity-based cryptosystem. Instead of generating and publishing a public key for each user, the identity-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct.This paper proposes a new identitybased cryptographic scheme for implementing public-key cryptosystem based on quadratic exponentiation randomized cryptosystem.The major advantage of the identity-based cryptosystem based on our scheme over other published identity-based cryptosystems is that the number of users can be extended to b ∗ L users without degrading the system’s security even when users cospire, where L is the number of the system’s secrets and b is the number of factors in N − 1.
منابع مشابه
ID-Based Cryptographic Schemes for User Identification, Digital Signature, and Key Distribution
AbstrucfIn 1984, Shamir introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify himself before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communica...
متن کاملConstructing Provably Secure ID-based Beta Cryptographic Scheme in Random Oracle
In this study, we propose a new ID-based beta cryptosystem scheme secure under selective identity adaptive chosen ciphertext security (IND-sID-CCA) under assumption in the random oracle model. We demonstrate that our scheme outperforms the other existing schemes in terms of security, computational cost and the length of public key.
متن کاملSecurity of an Identity-Based Cryptosystem and the Related Reductions
Recently an efficient solution to the discrete logarithm problem on elliptic curves over F, with p points ( p : prime), so-called anornalous curues, was independently discovered by Semaev [14], Smart [17], and Satoh and Araki [12]. Since the solution is very efficient, i.e., 0 ( l p l 3 ) , the Semaev-Smart-Satoh-Araki (SSSA) algorithm implies the possibility of realizing a trapdoor for the dis...
متن کاملConstructing identity-based cryptosystems for discrete logarithm based cryptosystems
In 1984, Shamir proposed the concept of the Identity-Based (ID-Based) cryptosystem. Instead of generating and publishing a public key for each user, the ID-Based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large publickey file is not ...
متن کاملIdentity Based Secure Routing For Wireless Ad-Hoc Networks
In this paper, we propose an Identity (ID)-based Secure Routing Scheme for secure routing in wireless ad-hoc networks. It make use of Identity based Signature scheme and hash chains to secure the AODV (Ad-hoc on demand distance vector routing) messages. We have used ID based Signature scheme for the immutable fields, that is the fields that remain same throughout the journey of the routing pack...
متن کامل